21![Minimization of Symmetric Submodular Functions under Hereditary Constraints J.A. Soto (joint work with M. Goemans) DIM, Univ. de Chile Minimization of Symmetric Submodular Functions under Hereditary Constraints J.A. Soto (joint work with M. Goemans) DIM, Univ. de Chile](https://www.pdfsearch.io/img/c4480408b0255e2ab49325d0c0d5f17a.jpg) | Add to Reading ListSource URL: www.dim.uchile.clLanguage: English - Date: 2013-08-08 17:44:20
|
---|
22![On the Tree Search Problem with Non-uniform Costs Ferdinando Cicalese∗ Bal´azs Keszegh† Bernard Lidick´ On the Tree Search Problem with Non-uniform Costs Ferdinando Cicalese∗ Bal´azs Keszegh† Bernard Lidick´](https://www.pdfsearch.io/img/f2937d8ff2f3743286b847e02514cb01.jpg) | Add to Reading ListSource URL: orion.math.iastate.eduLanguage: English - Date: 2014-08-22 14:44:58
|
---|
23![Noname manuscript No. (will be inserted by the editor) Subjective interestingness of subgraph patterns Matthijs van Leeuwen · Tijl De Bie · Eirini Spyropoulou · C´ Noname manuscript No. (will be inserted by the editor) Subjective interestingness of subgraph patterns Matthijs van Leeuwen · Tijl De Bie · Eirini Spyropoulou · C´](https://www.pdfsearch.io/img/86d672c52dc4f361048485aaeaea9674.jpg) | Add to Reading ListSource URL: www.patternsthatmatter.orgLanguage: English - Date: 2016-01-15 06:48:18
|
---|
24![CS264: Homework #10 Due by midnight on Wednesday, December 10, 2014 Instructions: (1) Students taking the course pass-fail should complete 5 of the exercises. Students taking the course for a letter grade should complete CS264: Homework #10 Due by midnight on Wednesday, December 10, 2014 Instructions: (1) Students taking the course pass-fail should complete 5 of the exercises. Students taking the course for a letter grade should complete](https://www.pdfsearch.io/img/a622527b1a4d750508566947117603fd.jpg) | Add to Reading ListSource URL: theory.stanford.eduLanguage: English - Date: 2014-12-10 00:55:12
|
---|
25![Robust Reoptimization of Steiner Trees∗ Keshav Goyal1 and Tobias Mömke2 1 2 IIT Delhi, India, Robust Reoptimization of Steiner Trees∗ Keshav Goyal1 and Tobias Mömke2 1 2 IIT Delhi, India,](https://www.pdfsearch.io/img/f84c28707e3a0273854845076da6a62a.jpg) | Add to Reading ListSource URL: drops.dagstuhl.deLanguage: English - Date: 2015-12-11 12:58:32
|
---|
26![Spanning tree / Mathematics / Distributed computing / Minimum spanning tree / Routing / Algorithm Spanning tree / Mathematics / Distributed computing / Minimum spanning tree / Routing / Algorithm](/pdf-icon.png) | Add to Reading ListSource URL: zoo.cs.yale.eduLanguage: English - Date: 2011-08-29 17:33:56
|
---|
27![Efficient Hierarchical Graph-Based Segmentation of RGBD Videos Steven Hickson1 Stan Birchfield2 Irfan Essa1 Efficient Hierarchical Graph-Based Segmentation of RGBD Videos Steven Hickson1 Stan Birchfield2 Irfan Essa1](https://www.pdfsearch.io/img/ce1e7d3ba535ddeb82320e214e4cb28f.jpg) | Add to Reading ListSource URL: www.cc.gatech.eduLanguage: English - Date: 2014-07-16 10:51:30
|
---|
28![Output-Sensitive Construction of the Union of Triangles Esther Ezra and Micha Sharir School of Computer Science Output-Sensitive Construction of the Union of Triangles Esther Ezra and Micha Sharir School of Computer Science](https://www.pdfsearch.io/img/a019560420b320060673b92f7865c80e.jpg) | Add to Reading ListSource URL: www.math.tau.ac.ilLanguage: English - Date: 2007-08-27 22:45:23
|
---|
29![Downloadedto. Redistribution subject to SIAM license or copyright; see http://www.siam.org/journals/ojsa.php SIAM J. COMPUT. Vol. 2, No. 4, DecemberSET MERGING ALGORITHMS* Downloadedto. Redistribution subject to SIAM license or copyright; see http://www.siam.org/journals/ojsa.php SIAM J. COMPUT. Vol. 2, No. 4, DecemberSET MERGING ALGORITHMS*](https://www.pdfsearch.io/img/4fdaf1b9cf4972a2c71f0b69d03d047d.jpg) | Add to Reading ListSource URL: bioinfo.ict.ac.cnLanguage: English - Date: 2015-11-19 07:35:47
|
---|
30![JOURNAL OF COMPUTATIONAL BIOLOGY Volume 6, Numbers 3/4, 1999 Mary Ann Liebert, Inc. Pp. 369– 386 Disk-Covering, a Fast-Converging Method JOURNAL OF COMPUTATIONAL BIOLOGY Volume 6, Numbers 3/4, 1999 Mary Ann Liebert, Inc. Pp. 369– 386 Disk-Covering, a Fast-Converging Method](https://www.pdfsearch.io/img/6be6a9f26b70d3e46f4c73613a4c7783.jpg) | Add to Reading ListSource URL: web.engr.illinois.eduLanguage: English - Date: 2016-05-15 16:25:24
|
---|